|
|
Agent Based Gameplaying System
Trutman, Michal ; Zbořil, František (referee) ; Král, Jiří (advisor)
This thesis deals with general game playing agent systems. On the contrary with common agents, which are designed only for a specified task or a game, general game playing agents have to be able to play basically any arbitrary game described in a formal declarative language. The biggest challenge is that the game rules are not known beforehand, which makes it impossible to use some optimizations or to make a good heuristic function. The thesis consists of a theoretical and a practical part. The first part introduces the field of general game playing agents, defines the Game Description Language and covers construction of heuristic evaluation functions and their integration within the Monte Carlo tree search algorithm. In the practical part, a general method of creating a new heuristic function is presented, which is later integrated into a proper agent, which is compared then with other systems.
|
|
|
Travelling Salesman Problem Application in Particular Logistics Enterprise
Ružička, Vladimír ; Bartík, Vladimír (referee) ; Kreslíková, Jitka (advisor)
This paper deals with optimal distribution issues. One may find listed problems of real life linked to distribution. Moreover, there are explained travelling salesman problem, vehicle routing problem and its variants. This work brings an overview of different ways how to solve vehicle routing problem. In practical part, there is an analysis of distribution of real company. The concept of application is presented in the second part of this paper. This concept could reduce costs of distribution in analyzed company. Testing is aimed mainly on the variant VRPCL (Vehicle Routing Problem with Continuos Loading).
|
|
|
Models and methods for routing problems
Nevrlý, Vlastimír ; Žák, Libor (referee) ; Popela, Pavel (advisor)
This master's thesis deals with mathematical model building for routing problems and ways to solve them. There are discussed and implemented deterministic and heuristic approaches that are suitable to be utilized. A big effort is put into building of the mathematical model describing a real world problem from the field of waste management. Appropriate algorithms are developed and modified to solve a particular problem effectively. An original graphical environment is created to illustrate acquired results and perform testing computations.
|
|
|
Demonstration of State Space Search Methods
Tureček, Martin ; Drozdová, Martina (referee) ; Zbořil, František (advisor)
This bachelor's thesis describes the issue of state space search methods. Thesis was focused namely on the practical part. Its main goal was to create a demonstration application which should serve as an additional help for Fundamentals of Artificial Intelligence course. The resulting application satisfies this requirement thanks to an easy control, a possibility of steping through the alghoritm and an attractive graphic layout. The application is also implemented as a java applet, so its start should be possible from anywhere.
|
|
|
Information System for a School Including Automated Timetabling
Švadlenka, Jiří ; Jurka, Pavel (referee) ; Chmelař, Petr (advisor)
This thesis devote itself to use of information system for school agenda administration. Schools are forced to administer big amounts of informations, not only referred to their students. Broad issue is very extensive and disparate, so the most common types of data and demands on school information system operation are stated. The system for automatic generation of timetables is part of the school information system. At the first, basic conceptions of scheduling scope are defined and tied together with them are methods and algorithms for timetable creation problem solving. School timetabling is problem of scheduling lessons with certain limitative conditions. Further, thesis is engaged in design of school information system, data organization in such system and solving of system design problems. Designed information system accentuates on easy expandability and wide range of usage possibilities. Also suggested algorithm for solving of defined school timetabling is stated in this part of thesis.
|
|
|
Algorithms for Computerized Optimization of Logistic Combinatorial Problems
Bokiš, Daniel ; Peringer, Petr (referee) ; Hrubý, Martin (advisor)
This thesis deals with optimization problems with main focus on logistic Vehicle Routing Problem (VRP). In the first part term optimization is established and most important optimization problems are presented. Next section deals with methods, which are capable of solving those problems. Furthermore it is explored how to apply those methods to specific VRP, along with presenting some enhancement of those algorithms. This thesis also introduces learning method capable of using knowledge of previous solutions. At the end of the paper, experiments are performed to tune the parameters of used algorithms and to discuss benefit of suggested improvements.
|
|
|
Attack Techniques on ELF/PE Files and Detection
Brunai, Adam ; Jurnečka, Peter (referee) ; Barabas, Maroš (advisor)
This thesis deals with the attack techniques on executable files in Windows OS. Its main goal is to analyze the file infection techniques in terms of their implementation and detection. Before the analysis, the reader will become familiar with executable files. Part of the thesis is demonstration tool named "pein" that solves implementation of infection. In conclusion, the work deals with the malware analysis and detection techniques.
|
|
|
Playing the Board Game Stratego by Computer
Irovský, Dominik ; Šátek, Václav (referee) ; Zbořil, František (advisor)
The topic of this thesis is the board game of Stratego. This game features incomplete information. The goal of this thesis is research of existing game playing algorithms and, design and implementation of new solution. For the new solution modified version of Monte Carlo Tree Search was used. The solution was implemented as a console application with possibility of future expansion. Functionality of the solution was validated and tested using experiments. Effectivity of the final algorithm was satisfying
|
|
|
Network flow models for waste management
Janošťák, František ; Mrázková, Eva (referee) ; Pavlas, Martin (advisor)
This thesis is devoted to the construction of new waste-to-energy plants in a territory where is already another fossil-fuel power station in operation. The aim is to create a mathematical model and prove that those two devices are able to cooperate effectively using same technology. Exactly assembled model under real operating have characteristics of a mixed integer nonlinear programming. The optimization software GAMS is used for its calculation. The complexity of the model, however, is at a level that solutions in bad initial conditions ends in local optima, or not found at all. This thesis is devoted to the elimination of non-linearity using binary variables and heuristic so the task was solved with acceptable time limits to guarantee an optimal solution.
|
|
|
A heuristic approach to resolving graphical point feature conflicts in large-scale maps
Pumr, Daniel ; Lysák, Jakub (advisor) ; Bayer, Tomáš (referee)
The paper deals with automation of cartographic generalization of point features by displacement and selection in large scale maps. In the first part of the thesis, the theoretical foundations of this process are introduced with emphasis on the works of authors who have dealt with its automation. The next part of the thesis describes and analyses the ZABAGED data from which the state map work is produced and on which the algorithm developed in the practical part of this thesis was tested. The main objective of the work was then to determine whether it is realistic to use a solution based on sequential intelligent testing of different offset positions of overlapping point features in practice. Within this framework, the strategies by which the state space given by the possible offset point positions can be generated and searched are identified and described. These strategies were then implemented over the ZABAGED dataset, tested and compared, and a conclusion was drawn on the applicability of this approach in automatic generalization. Key words digital cartography, cartographic generalization, generalization by selection, generalization by displacement, point features, heuristics
|
guest ::
